全文获取类型
收费全文 | 7490篇 |
免费 | 1204篇 |
国内免费 | 624篇 |
专业分类
电工技术 | 199篇 |
技术理论 | 1篇 |
综合类 | 759篇 |
化学工业 | 1028篇 |
金属工艺 | 93篇 |
机械仪表 | 340篇 |
建筑科学 | 368篇 |
矿业工程 | 64篇 |
能源动力 | 247篇 |
轻工业 | 88篇 |
水利工程 | 141篇 |
石油天然气 | 128篇 |
武器工业 | 83篇 |
无线电 | 829篇 |
一般工业技术 | 719篇 |
冶金工业 | 234篇 |
原子能技术 | 78篇 |
自动化技术 | 3919篇 |
出版年
2024年 | 24篇 |
2023年 | 115篇 |
2022年 | 184篇 |
2021年 | 245篇 |
2020年 | 250篇 |
2019年 | 269篇 |
2018年 | 244篇 |
2017年 | 298篇 |
2016年 | 312篇 |
2015年 | 353篇 |
2014年 | 459篇 |
2013年 | 554篇 |
2012年 | 529篇 |
2011年 | 554篇 |
2010年 | 428篇 |
2009年 | 456篇 |
2008年 | 451篇 |
2007年 | 536篇 |
2006年 | 390篇 |
2005年 | 367篇 |
2004年 | 332篇 |
2003年 | 262篇 |
2002年 | 226篇 |
2001年 | 198篇 |
2000年 | 147篇 |
1999年 | 139篇 |
1998年 | 108篇 |
1997年 | 75篇 |
1996年 | 88篇 |
1995年 | 82篇 |
1994年 | 75篇 |
1993年 | 52篇 |
1992年 | 53篇 |
1991年 | 47篇 |
1990年 | 32篇 |
1989年 | 36篇 |
1988年 | 21篇 |
1987年 | 16篇 |
1986年 | 12篇 |
1985年 | 25篇 |
1984年 | 34篇 |
1983年 | 33篇 |
1982年 | 32篇 |
1981年 | 23篇 |
1980年 | 34篇 |
1979年 | 38篇 |
1978年 | 17篇 |
1977年 | 9篇 |
1976年 | 13篇 |
1951年 | 6篇 |
排序方式: 共有9318条查询结果,搜索用时 15 毫秒
991.
We derive a bound on the computational complexity of linear programs whose coefficients are real algebraic numbers. Key to this result is a notion of problem size that is analogous in function to the binary size of a rational-number problem. We also view the coefficients of a linear program as members of a finite algebraic extension of the rational numbers. The degree of this extension is an upper bound on the degree of any algebraic number that can occur during the course of the algorithm, and in this sense can be viewed as a supplementary measure of problem dimension. Working under an arithmetic model of computation, and making use of a tool for obtaining upper and lower bounds on polynomial functions of algebraic numbers, we derive an algorithm based on the ellipsoid method that runs in time bounded by a polynomial in the dimension, degree, and size of the linear program. Similar results hold under a rational number model of computation, given a suitable binary encoding of the problem input.This research was founded by the National Science Foundation under Grant DMS88-10192. 相似文献
992.
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k≥2, is NP-hard [F. Blanchet-Sadri, R. Jungers, J. Palumbo, Testing avoidability on sets of partial words is hard, Theoret. Comput. Sci. 410 (2009) 968-972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are NP-hard, others are shown to be efficiently decidable. Using some combinatorial properties of de Bruijn graphs, we establish a correspondence between lengths of cycles in such graphs and periods of avoiding words, resulting in a tight bound for periods of avoiding words. We also prove that Avoidability can be solved in polynomial space, and reduces in polynomial time to the problem of deciding the avoidability of a finite set of partial words of equal length over the binary alphabet. We give a polynomial bound on the period of an infinite avoiding word, in the case of sets of full words, in terms of two parameters: the length and the number of words in the set. We give a polynomial space algorithm to decide if a finite set of partial words is avoided by a non-ultimately periodic infinite word. The same algorithm also decides if the number of words of length n avoiding a given finite set of partial words grows polynomially or exponentially with n. 相似文献
993.
Muhammad Adeel ZaffarAuthor Vitae Ram L. KumarAuthor Vitae 《Decision Support Systems》2011,51(3):597-608
The rising popularity of open source software (OSS) calls for a better understanding of the drivers of its adoption and diffusion. In this research, we propose an integrated framework that simultaneously investigates a broad range of social and economic factors on the diffusion dynamics of OSS using an Agent Based Computational Economics (ACE) approach. We find that interoperability costs, variability of OSS support costs, and duration of PS upgrade cycle are major determinants of OSS diffusion. Furthermore, there are interaction effects between network topology, network density and interoperability costs, which strongly influence the diffusion dynamics of OSS. The proposed model can be used as a building block to further investigate complex competitive dynamics in software markets. 相似文献
994.
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs are obtained by instantiating a semantic framework previously introduced by the authors and based on an innovative modification of realizability. The proof is a notable simplification on the original already semantic proof of soundness for the above mentioned logical systems and programming languages. A new result made possible by the semantic framework is the addition of polymorphism and a modality to LFPL, thus allowing for an internal definition of inductive datatypes. The methodology presented proceeds by assigning both abstract resource bounds in the form of elements from a resource monoid and resource-bounded computations to proofs (respectively, programs). 相似文献
995.
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a standard timed automaton. In both cases, we show that simulation checking is Exptime-hard, and for the case of a non-flat implementation, the result holds even if there is no synchronization between the parallel components and their alphabets of actions are pairwise disjoint. Moreover, we show that the considered problems become Pspace-complete when the specification is assumed to be deterministic. Additionally, we establish that comparing a synchronous non-flat system with no hiding and a flat system is Pspace-hard for any relation between trace containment and bisimulation equivalence, even if the flat system is assumed to be fixed. 相似文献
996.
P.-C. Héam 《Theoretical computer science》2011,412(41):5808-5813
Profinite topology is used in the classification of rational languages. In particular, several important decidability problems, related to the Malcev product, reduce to the computation of the closure of a rational language in the profinite topology. It is known that, given a rational language by a deterministic automaton, computing a deterministic automaton accepting its profinite closure can be done with an exponential upper bound. This paper is dedicated the study of a lower bound for this problem: we prove that, in some cases, if the alphabet contains at least three letters, it requires an exponential time. 相似文献
997.
We introduce a method based on Kolmogorov complexity to prove lower bounds on communication complexity. The intuition behind our technique is close to information theoretic methods.We use Kolmogorov complexity for three different things: first, to give a general lower bound in terms of Kolmogorov mutual information; second, to prove an alternative to Yao’s minmax principle based on Kolmogorov complexity; and finally, to identify hard inputs.We show that our method implies the rectangle and corruption bounds, known to be closely related to the subdistribution bound. We apply our method to the hidden matching problem, a relation introduced to prove an exponential gap between quantum and classical communication. We then show that our method generalizes the VC dimension and shatter coefficient lower bounds. Finally, we compare one-way communication and simultaneous communication in the case of distributional communication complexity and improve the previous known result. 相似文献
998.
We compare the fixed parameter complexity of various variants of coloring problems (including List Coloring, Precoloring Extension, Equitable Coloring, L(p,1)-Labeling and Channel Assignment) when parameterized by treewidth and by vertex cover number. In most (but not all) cases we conclude that parametrization by the vertex cover number provides a significant drop in the complexity of the problems. 相似文献
999.
Consider the “Number in Hand” multiparty communication complexity model, where k players holding inputs x1,…,xk∈{0,1}n communicate to compute the value f(x1,…,xk) of a function f known to all of them. The main lower bound technique for the communication complexity of such problems is that of partition arguments: partition the k players into two disjoint sets of players and find a lower bound for the induced two-party communication complexity problem.In this paper, we study the power of partition arguments. Our two main results are very different in nature:
- (i)
- For randomized communication complexity, we show that partition arguments may yield bounds that are exponentially far from the true communication complexity. Specifically, we prove that there exists a 3-argument function f whose communication complexity is Ω(n), while partition arguments can only yield an Ω(logn) lower bound. The same holds for nondeterministiccommunication complexity.
- (ii)
- For deterministic communication complexity, we prove that finding significant gaps between the true communication complexity and the best lower bound that can be obtained via partition arguments, would imply progress on a generalized version of the “log-rank conjecture” in communication complexity. We also observe that, in the case of computing relations (search problems), very large gaps do exist.
1000.